Carry - save Adders for Computing the Product Ab Modulo

not repeated. This prevents attacks like a probable text attack. Second, we incorporate error-correcting codes and the result is that our scheme provides an error detection and correction capability. Storage requirements for public keys are about 3 x lo5 bits, if n is about 300 or 400 bits. In addition, under this scheme, the sender has a very light load, while the receiver bears a heavy computational load. lndexing tenns: Digital circuits, Adders, Modular multiplication The letter describes a new algorithm for modulator multiplication using carryeve adders. The proposed algorithm is based on the signestimation technique. A carry-ve adder structure consisting of three rows of n + 3 simple 1-bit adder cells, and two copies of 3-bit carry look-ahead logic can be used to implement a single step of the algorithm. A completely pipclined array for modular multiplication designed by cascading n carry-ve adders performs modulator multiplication at the clock rate.